Unfair cops?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unfair permutations

We study unfair permutations, which are generated by letting [Formula: see text] players draw numbers and assuming that player [Formula: see text] draws [Formula: see text] times from the unit interval and records her largest value. This model is natural in the context of partitions: the score of the [Formula: see text]th player corresponds to the multiplicity of the summand [Formula: see text]...

متن کامل

Multimedia Authoring for CoPs

One way of providing technological support for CoPs is to help participants to produce, structure and share information. As this information becomes more and more multimedia in nature, the challenge is to build multimedia authoring and publishing tools that meets CoPs requirements. In this paper we analyze these requirements and propose a multimedia authoring model and a generic platform on whi...

متن کامل

CoPS - Team Description Stuttgart -

This paper presents the hardware and software design principles of the medium size RoboCup Team CoPS which are developed by the image understanding group at the Institute for Parallel and Distributed High Performance Systems (IPVR) of the University of Stuttgart. By adapting already successfully tested multiagent software concepts by our group to the domain of robotic soccer we intend to improv...

متن کامل

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic c...

متن کامل

Cops vs. Gambler

We consider a variation of cop vs. robber on graph in which the robber is not restricted by the graph edges; instead, he picks a time-independent probability distribution on V (G) and moves according to this fixed distribution. The cop moves from vertex to adjacent vertex with the goal of minimizing expected capture time. Players move simultaneously. We show that when the gambler’s distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1993

ISSN: 0028-0836,1476-4687

DOI: 10.1038/362655a0